Time dependent orienteering problem with time windows and service time dependent profits

• New OP variant with service time dependent profits and travel times. Mathematical formulation possible applications of this problem. Metaheuristic solution approach composed specific local moves. Benchmark instances known optimal solutions to verify the approach. Real data instance evaluate proposed model method. This paper addresses orienteering problem windows (TDOPTW-STP). In TDOPTW-STP, each vertex is assigned a minimum maximum profit collected at increases linearly time. The goal maximize total by determining subset vertices be visited assigning appropriate vertex, considering given budget windows. Moreover, times are departure To solve problem, mixed integer linear formulated metaheuristic algorithm based on variable neighborhood search (VNS) developed. uses three specifically designed structures able deal vertices. Extensive computational experiments conducted test adapted from TDOPTW benchmarks, validate performance our Furthermore, real for city Shiraz (Iran) generated. Experimental results demonstrate suitability TDOPTW-STP in practice, that obtain high-quality real-time. Sensitivity analyses clearly show significant impact route plan, especially presence dependency